An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
نویسندگان
چکیده
منابع مشابه
An Algorithm for Multiplication Modulo (2^N-1)
This paper propose an efficient algorithm for multipliers modulo . To achieve high speed, the Wallace tree is adopted for the multipliers. The proposed Wallace tree multipliers exhibit much more resular structure than binary Wallace tree cultipliers. Comparison with a previous counterpart shows favorable to our multiplier in both speed and hardware..
متن کاملEfficient VLSI Implementation of Modulo (2 1) Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo (2 1) and (2 + 1) are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are imp...
متن کاملEfficient VLSI Implementation of Modulo 2n 1 Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo 2 1 and 2 1 are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are improved ...
متن کاملSparse Gaussian Elimination Modulo p: An Update
This paper considers elimination algorithms for sparse matrices over finite fields. We mostly focus on computing the rank, because it raises the same challenges as solving linear systems, while being slightly simpler. We developed a new sparse elimination algorithm inspired by the GilbertPeierls sparse LU factorization, which is well-known in the numerical computation community. We benchmarked ...
متن کاملSquare Roots Modulo p
The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2007
ISSN: 1539-6746,1945-0796
DOI: 10.4310/cms.2007.v5.n2.a8